THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM

The paper deals with a digraph non-negative vertex weights. A subset \(W\) of the set vertices is called dominating if any that not belongs to it reachable from within precisely one step. minimal ceases be when removing it. investigates problem searching for maximum weight in vertex-weighted digraph. An integer linear programming model proposed this problem. tested on random instances and real choosing family key indicators specific socio-economic system. compares fixed number vertices.